Merging information under constraints: a qualitative framework

نویسندگان

  • Sébastien Konieczny
  • Ramón Pino Pérez
چکیده

We consider the problem of merging several belief bases in the presence of integrity constraints. We propose a logical characterization of operators having a majority behaviour or a consensual one. Then we give a representation theorem in terms of pre-orders on interpretations. We show the close connection between belief revision and merging operators and we show that our proposal extends the pure merging case (i.e. without integrity constraints) we study in a previous work. Finally we show that Liberatore and Schaerf commutative revision operators can be seen as a special case of merging.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Merging Information Under Constraints: A Logical Framework

The paper considers the problem of merging several belief bases in the presence of integrity constraints and proposes a logical characterization of operators having a majority behaviour or a consensual one. Then a representation theorem in terms of pre-orders on interpretations is given. The close connection between belief revision and merging operators is shown and it is shown that the proposa...

متن کامل

A Framework for Merging Qualitative Constraints Networks

Spatial or temporal reasoning is an important task for many applications in Artificial Intelligence, such as space scheduling, navigation of robots, etc. Several qualitative approaches have been proposed to represent spatial and temporal entities and their relations. These approaches consider the qualitative aspects of the space relations only, disregarding any quantitative measurement. In some...

متن کامل

Quasi-merging and Pure-arbitration on Information for the Family of Adaptive Logics ADM∗

The present paper introduces two new information merging protocols for the family of adaptive logics ADM, for which majority merging has been defined in previous work. The new adaptive operators reflect the negotiation processes of quasi-merging and pure-arbitration known from the Integrity Constraints framework. The Adaptive Variant Counting selection provides results equivalent to the GMax fa...

متن کامل

Merging Qualitative Constraints Networks Using Propositional Logic

In this paper we address the problem of merging qualitative constraints networks (QCNs). We propose a rational merging procedure for QCNs. It is based on translations of QCNs into propositional formulas, and take advantage of propositional merging operators.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007